Plane Partitions Vi: Stembridge’s Tspp Theorem
نویسندگان
چکیده
We provide a new proof of Stembridge’s theorem which validated the Totally Symmetric Plane Partitions (TSPP) Conjecture. The overall strategy of our proof follows the same general pattern of determinant evaluation as discussed by the first named author in a series of papers. The resulting hypergeometric multiple sum identities turn out to be quite complicated. Their correctness is proved by applying new algorithmic methods from symbolic summation.
منابع مشابه
Eliminating Human Insight: An Algorithmic Proof of Stembridge's TSPP Theorem
We present a new proof of Stembridge’s theorem about the enumeration of totally symmetric plane partitions using the methodology suggested in the recent Koutschan-Kauers-Zeilberger semi-rigorous proof of the Andrews-Robbins q-TSPP conjecture. Our proof makes heavy use of computer algebra and is completely automatic. We describe new methods that make the computations feasible in the first place....
متن کاملA New Sigma Approach to Multi-summation
We present a general algorithmic framework that allows not only to deal with summation problems over summands being rational expressions in indefinite nested sums and products (Karr 1981), but also over ∂-finite and holonomic summand expressions that are given by a linear recurrence. This approach implies new computer algebra tools implemented in Sigma to solve multi-summation problems efficien...
متن کاملA PROOF OF GEORGE ANDREWS’ AND DAVE ROBBINS’ q-TSPP CONJECTURE
The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product-formula, has been stated independently by George Andrews and Dave Robbins around 1983. We present a proof of this long-standing conjecture.
متن کاملProof of George Andrews's and David Robbins's q-TSPP Conjecture
1 Proemium In the historical conference Combinatoire Énumerative that took place at the end of May 1985 in Montréal, Richard Stanley raised some intriguing problems about the enumeration of plane partitions (see below), which he later expanded into a fascinating article [11]. Most of these problems concerned the enumeration of “symmetry classes” of plane partitions that were discussed in more d...
متن کاملA PROOF OF GEORGE ANDREWS’ AND DAVID ROBBINS’ q-TSPP CONJECTURE
The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product-formula, has been stated independently by George Andrews and David Robbins around 1983. We present a proof of this long-standing conjecture.
متن کامل